semQA: SPARQL with Idempotent Disjunction

Inference with Idempotent Valuations

Valuation based systems verifying an idem-potent property are studied. A partial order is deened between the valuations giving them a lattice structure. Then, two diierent strategies are introduced to represent valuations: as innmum of the most informative valuations or as supremum of the least informative ones. It is studied how to carry out computations with both representations in an eecient...

Inference with Idempotent Valuations

Valuation based systems verifying an idem­ potent property are studied. A partial or­ der is defined between the valuations giving them a lattice structure. Then, two different strategies are introduced to represent valu­ ations: as infimum of the most informative valuations or as supremum of the least in­ formative ones. It is studied how to carry out computations with both representations in ...

Combining Conjunction with Disjunction

In this paper we address some central problems of combination of logics through the study of a very simple but highly informative case, the combination of the logics of disjunction and conjunction. At first it seems that it would be very easy to combine such logics, but the following problem arises: if we combine these logics in a straightforward way, distributivity holds. On the other hand, di...

Logic Programs with Ordered Disjunction

Sparql Rules! Sparql Rules!

As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two related aspects. On the one hand, the definition of a suitable query language for RDF, SPARQL, seems to be close to candidate recommendation status within the W3C. The establishment of the rules layer on top of the exi...